Implementing Aggregation/Broadcast over Distributed Hash Tables
نویسندگان
چکیده
We present an algorithm for implementing aggregation/broadcast over existing Distributed Hash Tables (DHTs). Our algorithm builds an aggregation tree in a bottom-up fashion by mapping nodes to their parents in the aggregation tree with pre-determined function and maintains it using soft-state. We believe that the aggregation/broadcast function is a basic service that should be layered over existing DHTs to provide them with the ability to disseminate/collect information efficiently on a global scale and perhaps even to search for answers to arbitrary semistructured queries.
منابع مشابه
Implementing Dynamic Querying Search in k-ary DHT-based Overlays
Distributed Hash Tables (DHTs) provide scalable mechanisms for implementing resource discovery services in structured Peer-to-Peer (P2P) networks. However, DHT-based lookups do not support some types of queries which are fundamental in several classes of applications. A way to support arbitrary queries in structured P2P networks is implementing unstructured search techniques on top of DHT-based...
متن کاملSelf-Correcting Broadcast in Distributed Hash Tables
We present two broadcast algorithms that can be used on top of distributed hash tables (DHTs) to perform group communication and arbitrary queries. Unlike other P2P group communication mechanisms, which either embed extra information in the DHTs or use random overlay networks, our algorithms take advantage of the structured DHT overlay networks without maintaining additional information. The pr...
متن کاملA Robust Aggregation Tree on Distributed Hash Tables
As P2P networks grow in popularity, there is an emerging need to collect aggregate information from such systems on the parts of both administrators and application users, such as available network storage, computation capabilities, and network size estimation for randomized DHTs. Our goal is to enable a P2P network to compute an aggregation function (MIN, MAX, COUNT, SUM, AVG) over data residi...
متن کاملImplementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we support range queries through a balanced tree algorithm, Decentralized Balanced Tree, that runs over any DHT system. Our algorithm is based on the B-tree design that efficiently stores clustered data while maintainin...
متن کاملDHT Broadcast Optimisation with ID Assignment Rules
Decision making in a self-optimising distributed Organic Computing system requires information about the system’s state. Accurate information enables the overall system to respond better to state changes. Distributed systems can use different network protocols, e.g UPD or TCP/IP, to connect the nodes. There is no guarantee that all of these network protocols are able to send broadcasts. If all ...
متن کامل